// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
int n,ans;
struct node
{
	int t,c;
};
signed main()
{
	cin>>n;
	vector<node> no(3e5+5);
	vector<int> v(1e5+5);
	int l=0,r=0;
	for(int i=1;i<=n;i++)
	{
		int t,m,x;
		cin>>t>>m;
		for(int j=1;j<=m;j++)
		{
			cin>>x;
			no[++r]={t,x};
			if(++v[x]==1)ans++;
		}
		while(l<r&&t-no[l].t>=86400)
		{
			if(--v[no[l].c]==0)ans--;
			l++;
		}
		cout<<ans<<endl;
	}
	return 0;
}
